max-cut and Containment Relations in Graphs
نویسنده
چکیده
We study max-cut in classes of graphs defined by forbidding a single graph as a subgraph, induced subgraph, or minor. For the first two containment relations, we prove dichotomy theorems. For the minor order, we show how to solve max-cut in polynomial time for the class obtained by forbidding a graph with crossing number at most one (this generalizes a known result for K5-minor-free graphs) and identify an open problem which is the missing case for a dichotomy theorem.
منابع مشابه
Some Applications of Laplace Eigenvalues of Graphs Some Applications of Laplace Eigenvalues of Graphs
In the last decade important relations between Laplace eigenvalues and eigenvectors of graphs and several other graph parameters were discovered. In these notes we present some of these results and discuss their consequences. Attention is given to the partition and the isoperimetric properties of graphs, the max-cut problem and its relation to semideenite programming, rapid mixing of Markov cha...
متن کاملSome Applications of Laplace Eigenvalues of Graphs∗
In the last decade important relations between Laplace eigenvalues and eigenvectors of graphs and several other graph parameters were discovered. In these notes we present some of these results and discuss their consequences. Attention is given to the partition and the isoperimetric properties of graphs, the max-cut problem and its relation to semidefinite programming, rapid mixing of Markov ch...
متن کاملJust chromatic exellence in fuzzy graphs
A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...
متن کاملMAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that λ-precision graphs are planar for λ > 1/ √ 2 and give a dichotomy theorem for max-cut computational complexity on λ-precision unit disk graphs.
متن کاملAn exact algorithm for MAX-CUT in sparse graphs (Preliminary version)1
The MAX-CUT problem consists in partitioning the vertex set of a weighted graph into two subsets. The objective is to maximize the sum of weights of those edges that have their endpoints in two different parts of the partition. MAX-CUT is a well known NP-hard problem and it remains NP-hard even if restricted to the class of graphs with bounded maximum degree ∆ (for ∆ ≥ 3). In this paper we stud...
متن کامل